Lattice Reduction in Cryptology : An UpdatePhong
نویسنده
چکیده
Lattices are regular arrangements of points in space, whose study appeared in the 19th century in both number theory and crystallography. The goal of lattice reduction is to nd useful representations of lattices. A major breakthrough in that eld occurred twenty years ago, with the appearance of Lovv asz's reduction algorithm, also known as LLL or L 3. Lattice reduction algorithms have since proved invaluable in many areas of mathematics and computer science, especially in al-gorithmic number theory and cryptology. In this paper, we survey some applications of lattices to cryptology. We focus on recent developments of lattice reduction both in cryptography and cryptanalysis, which followed seminal works of Ajtai and Coppersmith.
منابع مشابه
Lattice Reduction in Cryptology: An Update
Lattices are regular arrangements of points in space, whose study appeared in the 19th century in both number theory and crystallography. The goal of lattice reduction is to nd useful representations of lattices. A major breakthrough in that eld occurred twenty years ago, with the appearance of Lovv asz's reduction algorithm, also known as LLL or L 3. Lattice reduction algorithms have since pro...
متن کاملBoostReduce - A Framework For Strong Lattice Basis Reduction
In this paper, we propose a new generic reduction framework BoostReduce for strong lattice basis reduction. At the core of our new framework is an iterative method which uses a newly-developed algorithm for finding short lattice vectors and integrating them efficiently into an improved lattice basis. We present BoostBKZ as an instance of BoostReduce using the Block-Korkine-Zolotarev (BKZ) reduc...
متن کاملAttack on Fully Homomorphic Encryption over the Integers
This paper presents a heuristic attack on the fully homomorphic encryption over the integers by using lattice reduction algorithm. Our result shows that the FHE in [DGHV10] is not secure for some parameter settings. We also present an improvement scheme to avoid the lattice attack in this paper.
متن کاملSPA-based attack against the modular reduction within a partially secured RSA-CRT implementation
This note describes an SPA-based side channel attack against a CRT implementation of an RSA function. In contrast with Novak’s attack [8], it concentrates on the initial modular reduction. With the help of lattice reduction it applies even to implementations which use a common randomising technique to ensure resistance against certain side channel attacks.
متن کاملSolving Hard Lattice Problems and the Security of Lattice-Based Cryptosystems
This paper is a tutorial introduction to the present state-of-the-art in the field of security of latticebased cryptosystems. After a short introduction to lattices, we describe the main hard problems in lattice theory that cryptosystems base their security on, and we present the main methods of attacking these hard problems, based on lattice basis reduction. We show how to find shortest vector...
متن کامل